#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;

const int N = 1e5 + 10, INF = 0x3f3f3f3f;

int n, m;
vector<int>g[N];
int du[N], st[N << 1], tt;

void dfs(int x)
{
    while (g[x].size()) {
        int y = g[x].back();g[x].pop_back();
        dfs(y);
    }
    st[++tt] = x;
}

void solve()
{
    cin >> n >> m;
    for (int i = 1;i <= m;i++) {
        int x, y;cin >> x >> y;
        g[x].push_back(y);
        du[x]++;du[y]--;
    }
    int cnt[2] = { 0,0 }, s = 1;
    for (int i = 1;i <= n;i++) {
        sort(g[i].begin(), g[i].end(), greater<int>());
        if (abs(du[i]) <= 1) {
            if (du[i] == 1) { cnt[0]++;s = i; }
            if (du[i] == -1) cnt[1]++;
        } else { cout << "No\n"; return; }
    }
    if ((cnt[0] != 1 && cnt[1] != 1) && (cnt[0] != 0 && cnt[1] != 0)) { cout << "No\n"; return; }
    if (cnt[0] == 0 && cnt[1] == 0) dfs(1);
    else dfs(s);
    for (int i = tt;i >= 1;i--) cout << st[i] << ' ';
}

signed main()
{
    //ios::sync_with_stdio(0);
    //cin.tie(0);cout.tie(0);
#define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
    std::istringstream in(R"()");
    std::cin.rdbuf(in.rdbuf());
#endif
    int T = 1;
    //cin>>T;
    for (int i = 1;i <= T;i++) {
        solve();
    }
}